Minimum-error state discrimination constrained by the no-signaling principle
نویسندگان
چکیده
منابع مشابه
Structure of minimum-error quantum state discrimination
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general stru...
متن کاملMinimum-error discrimination between mixed quantum states
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary m’s mixed quantum states with given prior probabilities. When m = 2, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. In particular, we show necessary and sufficient condi...
متن کاملMinimum error discrimination of Pauli channels
Abstract. We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, differently from the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows to achieve the optimal discrimination. We also provide a simple neces...
متن کاملGrover Search and the No-Signaling Principle.
Two of the key properties of quantum physics are the no-signaling principle and the Grover search lower bound. That is, despite admitting stronger-than-classical correlations, quantum mechanics does not imply superluminal signaling, and despite a form of exponential parallelism, quantum mechanics does not imply polynomial-time brute force solution of NP-complete problems. Here, we investigate t...
متن کاملDecision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estimates of the class distributions. In the present paper we introduce a new concept to binary tree design: instead of working with the class distributions of the data we work directly with the distribution of the errors ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2010
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.3298647